Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Free, publicly-accessible full text available January 2, 2026
-
This paper investigates the exotic phenomena exhibited by links of disconnected surfaces with boundary that are properly embedded in the 4-ball. Our main results provide two different constructions of exotic pairs of surface links that are Brunnian, meaning that all proper sublinks of the surface are trivial. We then modify these core constructions to vary the number of components in the exotic links, the genera of the components, and the number of components that must be removed before the surfaces become unlinked. Our arguments extend two tools from 3-dimensional knot theory into the 4-dimensional setting: satellite operations, especially Bing doubling, and covering links in branched covers.more » « less
-
Abstract LetMbe a connected, closed, oriented three-manifold andK, Ltwo rationally null-homologous oriented simple closed curves in M. We give an explicit algorithm for computing the linking number betweenKandLin terms of a presentation of Mas an irregular dihedral three-fold cover of $$S^3$$ branched along a knot$$\alpha \subset S^3$$ . Since every closed, oriented three-manifold admits such a presentation, our results apply to all (well-defined) linking numbers in all three-manifolds. Furthermore, ribbon obstructions for a knot $$\alpha $$ can be derived from dihedral covers of $$\alpha $$ . The linking numbers we compute are necessary for evaluating one such obstruction. This work is a step toward testing potential counter-examples to the Slice-Ribbon Conjecture, among other applications.more » « less
-
null (Ed.)Abstract We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on meridional rank are obtained via Coxeter quotients of the groups of link complements. Matching upper bounds on bridge number are found using the Wirtinger numbers of link diagrams, a combinatorial tool developed by the authors.more » « less
An official website of the United States government
